Cryptanalysis of matrix conjugation schemes
نویسندگان
چکیده
In this paper we cryptanalyze two protocols: GrigorievShpilrain authentication protocol and Wang et al. public key encryption protocols that use computational hardness of some variations of the conjugacy search problem in noncommutative monoids. We devise a practical heuristic algorithm solving those problems. As a conclusion we claim that these protocols are insecure for the proposed parameter values.
منابع مشابه
Artemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملEncryption Schemes based on Hadamard Matrices with Circulant Cores
In this paper, we propose two encryption schemes based on Hadamard matrices with one and two circulant cores, which are classes of combinatorial designs. A cryptanalysis of the proposed schemes against some popular attacks, brute force, plaintext attacks and ciphertext attacks is explored and our study shows that these attacks does not compromise the security of the system. Furthermore, we make...
متن کاملNew Shewhart-type synthetic bar{X} control schemes for non-normal data
In this paper, Burr-type XII ̄X synthetic schemes are proposed as an alternative to the classical ̄X synthetic schemes when the assumption of normality fails to hold. First, the basic design of the Burr-type XII ̄X synthetic scheme is developed and its performance investigated using exact formulae. Secondly, the non-side-sensitive and side-sensitive Burr-type XII ̄X synthetic schemes are int...
متن کاملC*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai
In [4], H. Imai and T. Matsumoto presented some new candidate trapdoor one-way permutations with a public key given as multivariate polynomials over a finite field. One of these schemes was later presented in [7] under the name C∗, and was based on the idea of hiding a monomial field equation. This scheme was broken in [8] by Jacques Patarin, due to unexpected algebraic properties. J. Patarin a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Mathematical Cryptology
دوره 8 شماره
صفحات -
تاریخ انتشار 2012